Non-conserving Flow Aspect of Maximum Dynamic Flow Problem
نویسندگان
چکیده
منابع مشابه
The Maximum Energy-Constrained Dynamic Flow Problem
We study a natural class of flow problems that occur in the context of wireless networks; the objective is to maximize the flow from a set of sources to one sink node within a given time limit, while satisfying a number of constraints. These restrictions include capacities and transit times for edges; in addition, every node has a bound on the amount of transmission it can perform, due to limit...
متن کاملInverse Maximum Dynamic Flow Problem under the Sum-Type Weighted Hamming Distance
Inverse maximum flow (IMDF), is among the most important problems in the field ofdynamic network flow, which has been considered the Euclidean norms measure in previousresearches. However, recent studies have mainly focused on the inverse problems under theHamming distance measure due to their practical and important applications. In this paper,we studies a general approach for handling the inv...
متن کاملThe maximum flow problem
In this network we have two special vertices: a source vertex s and a sink vertex t. Our goal is to send the maximum amount of flow from s to t; flow can only travel along arcs in the right direction, and is constrained by the arc capacities. This “flow” could be many things: imagine sending water along pipes, with the capacity representing the size of the pipe; or traffic, with the capacity be...
متن کاملTransfomation of Non-feasible Inverse Maximum Flow Problem into a Feasible one by Flow Modification
A linear time method to decide if any inverse maximum flow (denoted IMFG) problem has solution is presented. For the case of IMFG not being feasible, a new inverse combinatorial optimization problem is introduced and solved. The problem is to modify as little as possible the flow so that the problem becomes feasible for the modified flow. Key–Words: inverse combinatorial optimization, maximum f...
متن کاملFormulation of the Maximum Flow Problem
Today we will continue the theme of studying cuts in graphs. In particular we will be studying a very interesting problem called the max flow problem. Before that, a short history lesson. During the Cold War, the US Air Force at that time was very interested in the Soviet train networks. In reports that were declassified in 1999, it was revealed that the Air Force collected enough information a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Institute of Engineering
سال: 2018
ISSN: 1810-3383
DOI: 10.3126/jie.v14i1.20073